Minimal almost convexity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Almost Convexity

In this article we show that the Baumslag-Solitar group BS(1, 2) is minimally almost convex, or MAC. We also show that BS(1, 2) does not satisfy Poénaru’s almost convexity condition P (2), and hence the condition P (2) is strictly stronger than MAC. Finally, we show that the groups BS(1, q) for q ≥ 7 and Stallings’ non-FP3 group do not satisfy MAC. As a consequence, the condition MAC is not a c...

متن کامل

Minimal trees and monophonic convexity

Let V be a finite set and M a collection of subsets of V . Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V , then the elements of M are called convex sets and the pair (V,M) is called an alignment or a convexity. If S ⊆ V , then the convex hull of S is the smallest convex set that contains S. Supp...

متن کامل

The Loop Shortening Property and Almost Convexity

We introduce the loop shortening property and the basepoint loop shortening property for finitely generated groups, and examine their relation to quadratic isoperimetric functions and almost convexity.

متن کامل

Tame Combing and Almost Convexity Conditions

We explore relationships between the family of successively weaker almost convexity conditions, and successively weaker tame combing conditions. We show that both Thompson’s group F and the Baumslag-Solitar groups BS(1, p) with p ≥ 3 admit a tame combing with a linear radial tameness function. By earlier work of Belk and Bux showing that F is not minimally almost convex, and of Elder and Hermil...

متن کامل

On Minimal and Almost-Minimal Linear Codes

Minimal linear codes are such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing and secure two-party computations. We pursue here the study of minimal codes and construct infinite families with asymptotically non-zero rates. We also introduce a relaxation to almost minima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Group Theory

سال: 2005

ISSN: 1433-5883,1435-4446

DOI: 10.1515/jgth.2005.8.2.239